Lively quantum walks on cycles
نویسندگان
چکیده
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined as the ability to execute a long-range move. We investigate the behavior of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a simple recipe for improving the efficiency of the network exploration.
منابع مشابه
Loop-erased Random Walks, Spanning Trees and Hamiltonian Cycles
We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson’s algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.
متن کاملMixing and decoherence in continuous-time quantum walks on cycles
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315) of a similar phenomenon for discrete-time quantum walks. Our analytical treatment of continuous-time quantum walks includes a continuous monitoring of all ve...
متن کاملMixing and Decoherence in Continuous-time quantum walks on long-range interacting cycles
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance m in the cycle graph. In our investigation, each node is continuously monitored by an individual point contact (PC), which induces the decoherence process. We obtain the analytical probability distribution and the m...
متن کاملMixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملNilpotent Adjacency Matrices and Random Graphs
While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotentgenerated algebra, a “new” adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting Xk denote the number of k-cycles occurring in a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.02802 شماره
صفحات -
تاریخ انتشار 2015